Tessellation automata on free groups

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Two-sided Pushdown Automata over Free Groups

In the two-sided pushdown automata discussed in this paper, their two-sided pushdowns are introduced over free groups rather than free monoids. It is demonstrated that these automata with pushdowns introduced in this way characterize the family of recursively enumerable languages.

متن کامل

On a series of finite automata defining free transformation groups

We introduce two series of finite automata starting from the socalled Aleshin and Bellaterra automata. We prove that each automaton in the first series defines a free non-Abelian group while each automaton in the second series defines the free product of groups of order 2. Furthermore, these properties are shared by disjoint unions of any number of distinct automata from either series.

متن کامل

Cloud modeling of quasi - order groups on general fuzzy automata

In this paper, first a simplified version of a general fuzzy automaton with a fixed c is defined and then a subepisode of a simplified version of a general fuzzy automaton with a constant c is defined and explained connected and strong connected them, and finally, a model of quasi-order hypergroup on general fuzzy automaton with constant c is presented and the relationships between them are rev...

متن کامل

Cellular Automata in the Triangular Tessellation

For t he discussion below t he following definit ions are helpful. A semito-talistic CA rule is a rul e for a cellular aut omaton (CA) where (a) we tally t he living neighbors t o a cell without regard to their orient atio n wit h respect t o th at cell, and (b) t he ru le applied t o a cell may depend upon its current status. A lifelike rule (LFR rul e) is a semit otalist ic CA rul e where (1)...

متن کامل

On Groups and Counter Automata

We study finitely generated groups whose word problems are accepted by counter automata. We show that a group has word problem accepted by a blind n-counter automaton in the sense of Greibach if and only if it is virtually free abelian of rank n; this result, which answers a question of Gilman, is in a very precise sense an abelian analogue of the Muller-Schupp theorem. More generally, if G is ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Hiroshima Mathematical Journal

سال: 1995

ISSN: 0018-2079

DOI: 10.32917/hmj/1206127632